Logics and Automata for Totally Ordered Trees

نویسندگان

  • Marco Kuhlmann
  • Joachim Niehren
چکیده

A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we study monadic second-order logic (MSO) for totally ordered terms. We show that the MSO satisfiability problem of unrestricted structures is undecidable, but give a decision procedure for practically relevant sub-classes, based on tree automata.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logics for Unranked Trees: An Overview

Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Further...

متن کامل

A Landscape of Logics for Finite Unordered Unranked Trees

In this paper we study a large number of logics to define languages of unordered unranked trees and compare their expressive power. Generally speaking, the logics we consider stem from three non-disjoint areas: logics related to automata theory, logics discussed in descriptive complexity theory, and second-order logics. The basic logic from automata theory is monadic second-order logic. Two ext...

متن کامل

Properties of Subtree-Prune-and-Regraft Operations on Totally-Ordered Phylogenetic Trees

We study some properties of subtree-prune-and-regraft (SPR) operations on leaflabelled rooted binary trees in which internal vertices are totally ordered. Since biological events occur with certain time ordering, sometimes such totally-ordered trees must be used to avoid possible contradictions in representing evolutionary histories of biological sequences. Compared to the case of plain leaf-la...

متن کامل

Algebraic characterization of temporal logics on forests

We propose a rich class FL(L) of temporal logics, parametrized by a class L of modalities, evaluated over forests, that is, ordered tuples of ordered but unranked finite trees, an algebraic product operation (which we call the Moore product) of forest automata, and show that these logically defined classes of forest languages are characterized precisely via the Moore product. As an application ...

متن کامل

Automata and Logics for Words and Trees over an Infinite Alphabet

In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of semistructured data, timed automata and extended temporal logics. This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008